UNIVERSITY OF SUSSEX COMPUTER SCIENCE A typed, prioritized process algebra Alan Jeffrey

Source URL: ect.bell-labs.com

• Bisimulation
• Logic in computer science
• Theoretical computer science
• Substitution
• Generalised Whitehead product

Pattern-Matching Spi-Calculus∗ Christian Haack Security of Systems Group Faculty of Science, Radboud University Postbus 9010, 6500 GL Nijmegen, The Netherlands

Source URL: ect.bell-labs.com

• Message authentication codes
• Public-key cryptography
• Public key infrastructure
• RSA
• BurrowsAbadiNeedham logic
• XTR

Optimizing the Runtime Processing of Types in a Higher-Order Logic Programming Language Gopalan Nadathur and Xiaochu Qi Department of Computer Science and Engineering, University of Minnesota, 4-192 EE/CS Building, 200 U

Source URL: www-users.cs.umn.edu

Linear Equational Tree Logic Linear Equational Dag Logic An Equational Logic for PROPs Gordon Plotkin Laboratory for the Foundations of Computer Science, School of Informatics,

Source URL: www.pps.univ-paris-diderot.fr

A TOOL FOR CHECKING GRAPHIC LOGIC IN SVG MAPS Masatoshi ARIKAWA*, Fumio FUJIMORI* and Takashi MORITA** * Center for Spatial Information Science, The University of Tokyo Email. {arikawa, fujimori}@csis.u-tokyo.ac.jp ** De

Source URL: home.csis.u-tokyo.ac.jp

Semantics for core Concurrent ML using computation types Alan Jeffrey Abstract This paper presents two typed higher-order concurrent functional programming languages, based on Reppy’s Concurrent ML. The first is a simp

Source URL: ect.bell-labs.com

• Theoretical computer science
• Logic in computer science
• Software engineering
• Formal methods
• Programming language semantics
• Models of computation
• Operational semantics
• Semantics
• Bisimulation
• Process calculus
• Programming language
• Transition system

Conservative Logic1 Edward Fredkin and Tommaso Toffoli MIT Laboratory for Computer Science 545 Technology Square Cambridge, MassachusettsConservative logic is a comprehensive model of computation which explicitly

Source URL: strangepaths.com

Kripke semantics for modal bilattice logic Achim Jung Umberto Rivieccio School of Computer Science

Source URL: www.cs.bham.ac.uk

Domain Theory Corrected and expanded version Samson Abramsky1 and Achim Jung2 This text is based on the chapter Domain Theory in the Handbook of Logic in Computer Science, volume 3, edited by S. Abramsky, Dov M. Gabbay,

Source URL: www.cs.bham.ac.uk

Inductive Fixpoints in Higher Order Logic Sava Krsti´c OGI School of Science and Engineering Oregon Health and Sciences University Abstract

Source URL: www.csee.ogi.edu